Optimal approximation of monotone curves on a grid
نویسندگان
چکیده
This paper presents eecient algorithms for approximating a curve by a polygonal chain with vertices on a grid. We are given an x-monotone curve y = f(x) consisting of N pieces on some mn grid. Our goal is to compute an approximation of the given curve by an x-monotone polygonal chain whose vertices are points of the grid. For that, we discuss several optimization criteria such as minimizing the area of the region bounded by the given curve and the polygonal chain. Our approach is based on a reduction to the computation of minimum-cost paths. We present an O(N + n 2) time and O(N + n) space algorithm for computing an optimal x-monotone polygonal chain. If we add the restriction that the horizontal lengths of the line segments used for the approximation is bounded by k, the time complexity can further be reduced to O(N + kn). In both cases, the time complexity does not depend on the range m of the function. Applications of this problem can be found, e.g., in the area of computer graphics.
منابع مشابه
B-Spline-Based Monotone Multigrid Methods
Abstract. For the efficient numerical solution of elliptic variational inequalities on closed convex sets, multigrid methods based on piecewise linear finite elements have been investigated over the past decades. Essential for their success is the appropriate approximation of the constraint set on coarser grids which is based on function values for piecewise linear finite elements. On the other...
متن کاملDegree Reduction of Disk Wang-Bézier Type Generalized Ball Curves
A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...
متن کاملA Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
A Shape Constrained Curve Approximation Method for Styling Surfaces Modeling
The problem of styling surfaces modeling is tackled. An approach based on section curves fairing is chosen. The concept of template curves is developed for approximating profiles with a monotone curvature variation. Constrained Bezier curves called typical curves are used for that. A curve growing process based on a G typical curve fitting method, is investigated. It consists first in determini...
متن کاملMultiple Stopping Time POMDPs: Structural Results & Application in Interactive Advertising in Social Media
This paper considers a multiple stopping time problem for a Markov chain observed in noise, where a decision maker chooses at most L stopping times to maximize a cumulative objective. We formulate the problem as a Partially Observed Markov Decision Process (POMDP) and derive structural results for the optimal multiple stopping policy. The main results are as follows: i) The optimal multiple sto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995